parallel simrank comput larg graph iter aggreg guom haijun feng cuip li hong chen recent lot interest graph base analysi import aspect graph base analysi measur similar node graph simrank simpl influenti measur kind base solid graph theoret model exist method simrank comput suffer limit comput cost high practic appli static graph paper exploit inher parallel high memori bandwidth graphic process unit gpu acceler comput simrank larg graph base observ simrank essenti order markov chain propos util iter aggreg techniqu uncoupl markov chain comput simrank score parallel larg graph iter aggreg method appli dynam graph handl link updat problem node updat problem extens experi synthet real data set verifi propos method effici effect 